The local limit of uniform spanning trees
نویسندگان
چکیده
We show that the local limit of uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to $$\infty $$ is Poisson(1) branching process conditioned survive forever. An extension “almost” graphs and a quenched version are also given.
منابع مشابه
Uniform spanning trees on Sierpiński graphs
We study spanning trees on Sierpiński graphs (i.e., finite approximations to the Sierpiński gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpiński graph and show that this construction gives rise to a multi-type Galton-Watson tree. We derive a number of structural results, for instance on the degree distribution....
متن کاملThe Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
A random walk on a finite graph can be used to construct a uniform random spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
متن کاملLoop Erased Walks and Uniform Spanning Trees
The uniform spanning tree has had a fruitful history in probability theory. Most notably, it was the study of the scaling limit of the UST that led Oded Schramm [Sch00] to introduce the SLE process, work which has revolutionised the study of two dimensional models in statistical physics. But in addition, the UST relates in an intrinsic fashion with another model, the loop erased random walk (or...
متن کاملRooted Uniform Monotone Minimum Spanning Trees
We study the construction of the minimum cost spanning geometric graph of a given rooted point set P where each point of P is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions (xy-monotonicity). We propose algorithms tha...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2021
ISSN: ['0178-8051', '1432-2064']
DOI: https://doi.org/10.1007/s00440-021-01072-2